Decompositions of regular bipartite graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonian decompositions of random bipartite regular graphs

We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Ha...

متن کامل

Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs

It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.

متن کامل

q - regular bipartite graphs

An explicit construction of a family of binary LDPC codes called LU(3, q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a 4-dimensional symplectic vector space and the action of the symplectic group and its subgroups.

متن کامل

Multicolored forests in bipartite decompositions of graphs

We show that in any edge-coloring of the complete graph Kn on n vertices, such that each color class forms a complete bipartite graph, there is a spanning tree of Kn no two of whose edges have the same color. This strengthens a theorem of Graham and Pollak and verifies a conjecture of de Caen. More generally we show that in any edge-coloring of a graph G with p positive and q negative eigenvalu...

متن کامل

Regular bipartite graphs are antimagic

A labeling of a graph G is a bijection from E(G) to the set {1, 2, . . . , |E(G)|}. A labeling is antimagic if for any distinct vertices u and v, the sum of the labels on edges incident to u is different from the sum of the labels on edges incident to v. We say a graph is antimagic if it has an antimagic labeling. In 1990, Ringel conjectured that every connected graph other than K2 is antimagic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1991

ISSN: 0012-365X

DOI: 10.1016/0012-365x(91)90396-j